#include <iostream>
#include "Algo_Sort/sort.h"
using namespace std;

int main()
{
    vector<int> data={2,45,6,8,22,  11,37,66,3,54,  55,7,68,17,18,  19,98,86,85,4,  10,32,29,4,51};
    int num=25;
    sort_base * p_sort;
    cout << "Hello World!--sort_Bubble--" << endl;
    p_sort = new sort_Bubble(data,num);
    cout << "Hello World!--sort_QuickSort--" << endl;
    p_sort = new sort_QuickSort(data,num);
    cout << "Hello World!--sort_QuickSort2--" << endl;
    p_sort = new sort_QuickSort2(data,num);
    cout << "Hello World!--sort_Insertion1--" << endl;
    p_sort = new sort_Insertion1(data,num);
    cout << "Hello World!--sort_Insertion2--" << endl;
    p_sort = new sort_Insertion2(data,num);
    cout << "Hello World!--sort_Shell1--" << endl;
    p_sort = new sort_Shell1(data,num);
    cout << "Hello World!--sort_Shell2--" << endl;
    p_sort = new sort_Shell2(data,num);
    cout << "Hello World!--sort_sort_Selection--" << endl;
    p_sort = new sort_Selection(data,num);
    cout << "Hello World!--sort_Heap--" << endl;
    p_sort = new sort_Heap(data,num);
    cout << "Hello World!--sort_Merge--" << endl;
    p_sort = new sort_Merge(data,num);
    cout << "Hello World!--sort_Counting--" << endl;
    p_sort = new sort_Counting(data,num);
    cout << "Hello World!--sort_Bucket--" << endl;
    p_sort = new sort_Bucket(data,num);
    cout << "Hello World!--sort_Radix--" << endl;
    p_sort = new sort_Radix(data,num);
    return 0;
}
